Analysis of Contour Crossings in Contour-Advective Simulations - Part 1 - Algorithm

نویسنده

  • T. M. Schaerf
چکیده

This is the first of two papers devoted to the analysis of contour crossing errors that occur in contour-advective simulations of fluid motion. Here an algorithm is presented for quantifying the error due to contour crossings. The method for analysing contour crossing errors works in several stages. The first step is to determine the relative proximity of all possible pairs of contours. A digital representation of each contour is produced to aid in the corresponding calculation. Simple analysis of functions is then used to find any crossings between contours deemed close to each other by the digital representation method. Next, the area in error of a pair of crossing contours is calculated by identifying the polygon or polygons that approximately bound the erroneous region. Finally, some preliminary results of analysis of contour crossings that occur in Contour-Advective Semi-Lagrangian (CASL) simulations of single layer quasigeostrophic turbulence are presented. It is shown that the error due to contour crossings is small in the simulations considered here.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Contour Crossings in Contour-Advective Simulations of Geophysical Fluid Flows

Contour crossings are a form of numerical error common to contour dynamical and contour-advective simulations of geophysical fluid flows. This thesis is devoted to the study of contour crossings that occur in simulations of fluid motion performed by the Contour-Advective Semi-Lagrangian (CASL) algorithm. Components of the CASL algorithm relevant to the study of contour crossings are discussed. ...

متن کامل

Contour Crafting Process Plan Optimization Part I: Single-Nozzle Case

Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...

متن کامل

A Modified Character Segmentation Algorithm for Farsi Printed Text Using Upper Contour Labelling

In this paper, a modified segmentation algorithm for printed Farsi words is presented. This algorithm is based on a previous work by Azmi that uses the conditional labeling of the upper contour to find the segmentation points. The main objective is to improve the segmentation results for low quality prints. To achieve this, various modifications on local baseline detection, contour labeling an...

متن کامل

A Modified Character Segmentation Algorithm for Farsi Printed Text Using Upper Contour Labelling

In this paper, a modified segmentation algorithm for printed Farsi words is presented. This algorithm is based on a previous work by Azmi that uses the conditional labeling of the upper contour to find the segmentation points. The main objective is to improve the segmentation results for low quality prints. To achieve this, various modifications on local baseline detection, contour labeling an...

متن کامل

Contour Crafting Process Plan Optimization Part II: Multi–Machine Cases

Contour Crafting is an emerging technology that uses robotics to construct free form building structures by repeatedly laying down layers of material such as concrete. The Contour Crafting technology scales up automated additive fabrication from building small industrial parts to constructing buildings. Tool path planning and optimization for Contour Crafting benefit the technology by increasin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008